New Version-Space Representations for Efficient Instance Retraction
نویسندگان
چکیده
Instance retraction is a difficult problem for concept learning by version spaces. In this paper, two new version-space representations are introduced: instance-based maximal boundary sets and instancebased minimal boundary sets. They are correct representations for the class of admissible concept languages and are efficiently computable. Compared to other representations, they are the most efficient practical version-space representations for instance retraction.
منابع مشابه
One-Sided Instance-Based Boundary Sets
Instance retraction is a difficult problem for concept learning by version spaces. This chapter introduces a family of version-space representations called one-sided instance-based boundary sets. They are correct and efficiently computable representations for admissible concept languages. Compared to other representations, they are the most efficient useful version-space representations for ins...
متن کاملUnifying Version Space Representations: Part II
In this paper we continue our research on unification of version-space representations. We consider the open question how to unify one-sided versionspace representations. To answer the question we introduce a new family of version-space representations that can be adapted during the learning process. The family consists of two dual representations: adaptable one-sided maximal boundary sets (AOM...
متن کاملGeneralising Boundary Sets
This report proposes adaptable boundary sets as a new version-space representation. It is shown that adaptable boundary sets can be adjusted to a version-space representation between boundary sets [5, 6, 7] and instance-based boundary sets [11, 12, 13]. This allows the choice of proper version-space representations to be realised dynamically during the learning phase.
متن کاملAdaptable Boundary Sets
This paper proposes adaptable boundary sets as a new version-space representation. It is shown that adaptable boundary sets can be adjusted to a version-space representation between boundary sets [5, 6, 7] and instance-based boundary sets [11, 12, 13]. This allows the choice of proper version-space representations to be realised dynamically during the learning phase.
متن کاملDescription Identification and Retraction with Integrated Instance/Concept-Based Boundary Sets
This paper presents incremental version space algorithms for description identification and retracting training data. The correctness of the algorithms is proven for the class of admissible description languages when version spaces to be learned are represented with integrated instance/conceptbased boundary sets (Smirnov and Braspenning 1998b). It is shown that the exponential complexity of des...
متن کامل